Modified Iterations for Data-Sparse Solution of Linear Systems
نویسندگان
چکیده
Abstract A modification of standard linear iterative methods for the solution equations is investigated aiming at improved data-sparsity with respect to a rank function. The convergence speed modified method compared growth its iterates certain model cases. considered general setup common in data-sparse treatment high dimensional problems such as sparse approximation and low tensor calculus.
منابع مشابه
Solution of Sparse Linear Systems
We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A is large, sparse and symmetric positive deenite. In a previous paper we developed an algorithm to compute a ll-reducing nested dissection ordering of A on a distributed memory machine. We n o w develop algorithms for the remaining steps of the solution process. The large-grain task parallelism r...
متن کاملSolution of Systems of Linear Equations by Minimized Iterations
In an earlier publication [14] a method was described which generated the eigenvalues and eigenvectors of a matrix by a successive algorithm based on minimizations by least squares. The advantage of this method consists in the fact that the successive iterations are constantly employed with maximum efficiency which guarantees fastest convergence for a given number of iterations. Moreover, with ...
متن کاملScalable Iterative Solution of Sparse Linear Systems
The eeciency of a parallel implementation of the conjugate gradient method precon-ditioned by an incomplete Cholesky factorization can vary dramatically depending on the column ordering chosen. One method to minimize the number of major parallel steps is to choose an ordering based on a coloring of the symmetric graph representing the nonzero adjacency structure of the matrix. In this paper, we...
متن کاملEecient Approximate Solution of Sparse Linear Systems
We consider the problem of approximate solution e x of a linear system Ax = b over the reals, such that kAe x ? bk kbk; for a given ; 0 < < 1: This is one of the most fundamental of all computational problems. Let (A) = kAkkA ?1 k be the condition number of the n n input matrix A. Sparse, diagonally dominant (DD) linear systems appear very frequently in the solution of linear systems associated...
متن کاملSparse Solution of Under-determined Linear Systems
We study an unconstrained version of the lq minimization for the sparse solution of under-determined linear systems for 0 < q ≤ 1. Although the minimization is nonconvex when q < 1, we introduce a regularization and develop an iterative algorithm. We show that the iterative algorithm converges and the iterative solutions converge to the sparse solution under some additional assumptions on under...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam journal of mathematics
سال: 2021
ISSN: ['2305-221X', '2305-2228']
DOI: https://doi.org/10.1007/s10013-021-00504-9